Wormhole Versus Deflection Routing: A Case Study on the Mesh

In this paper we are comparing (via simulations) under real conditions, several routing algorithms based either on oblivious worm-hole routing or deeection routing. Although these two techniques diier signiically in the low level structure of information (worms, packets), we derived realistic results using an appropriate simulation model. In our experiments we compared average time, latency and throughput achieved by both deeection and wormhole routing (for both batch and continuous cases). Results show that deeection routing performs better than wormhole routing, for random traac on the mesh, especially for large networks. Furthermore, although it is hard to analyze simple versions of wormhole routing, it seems that these versions outperform algorithms that are devised in order to simplify theoretical analysis. Finally we implemented and tested an algorithm that combines both deeection and wormhole routing.